package src.算法.递归;

public class Fibora {
    // 递归求斐波拉且数列 1,1,2,3,5,8,13,21
    public static int fibora(int n){
        // 按索引1开始
        if(n==1 || n==2){
            return 1;
        }
        return fibora(n-2)+fibora(n-1);
    }

    public static void main(String[] args) {

        System.out.println(fibora(3));
    }
}
